0.05/0.09	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.05/0.11	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.11/0.32	% Computer   : n005.cluster.edu
0.11/0.32	% Model      : x86_64 x86_64
0.11/0.32	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.32	% Memory     : 8042.1875MB
0.11/0.32	% OS         : Linux 3.10.0-693.el7.x86_64
0.11/0.32	% CPULimit   : 1200
0.11/0.32	% WCLimit    : 120
0.11/0.32	% DateTime   : Tue Jul 13 14:33:33 EDT 2021
0.11/0.32	% CPUTime    : 
0.11/0.32	% Number of cores: 8
0.11/0.32	% Python version: Python 3.6.8
0.11/0.32	# Version: 2.6rc1-ho
0.11/0.33	# No SInE strategy applied
0.11/0.33	# Trying AutoSched0 for 59 seconds
2.41/2.65	# AutoSched0-Mode selected heuristic G_E___208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
2.41/2.65	# and selection function SelectComplexExceptUniqMaxHorn.
2.41/2.65	#
2.41/2.65	# Preprocessing time       : 0.544 s
2.41/2.65	# Presaturation interreduction done
2.41/2.65	
2.41/2.65	# Proof found!
2.41/2.65	# SZS status Theorem
2.41/2.65	# SZS output start CNFRefutation
2.41/2.65	thf(mand, axiom, (mand)=(^[X4:$i > $o, X5:$i > $o, X198:$i]:~((~(X4 @ X198)|~(X5 @ X198)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax', mand)).
2.41/2.65	thf(mnot, axiom, (mnot)=(^[X4:$i > $o, X3:$i]:~(X4 @ X3)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax', mnot)).
2.41/2.65	thf(mor, axiom, (mor)=(^[X4:$i > $o, X5:$i > $o, X3:$i]:(X4 @ X3|X5 @ X3)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax', mor)).
2.41/2.65	thf(mimplies, axiom, (mimplies)=(^[X4:$i > $o, X5:$i > $o, X201:$i]:(~(X4 @ X201)|X5 @ X201)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax', mimplies)).
2.41/2.65	thf(cl5_nebula_array_0014, conjecture, mvalid @ (mbox_s4 @ (mimplies @ (mand @ (mbox_s4 @ (leq @ n0 @ pv31)) @ (mand @ (mbox_s4 @ (leq @ n0 @ pv35)) @ (mand @ (mbox_s4 @ (leq @ pv31 @ (minus @ n5 @ n1))) @ (mbox_s4 @ (leq @ pv35 @ (minus @ n135300 @ n1)))))) @ (mand @ (mbox_s4 @ (leq @ n0 @ pv31)) @ (mand @ (mbox_s4 @ (leq @ n0 @ pv35)) @ (mand @ (mbox_s4 @ (leq @ pv31 @ (minus @ n5 @ n1))) @ (mbox_s4 @ (leq @ pv35 @ (minus @ n135300 @ n1)))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cl5_nebula_array_0014)).
2.41/2.65	thf(mvalid, axiom, (mvalid)=(^[X4:$i > $o]:![X3:$i]:X4 @ X3), file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax', mvalid)).
2.41/2.65	thf(mbox_s4, axiom, (mbox_s4)=(^[X4:$i > $o, X3:$i]:![X7:$i]:(~(rel_s4 @ X3 @ X7)|X4 @ X7)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^5.ax', mbox_s4)).
2.41/2.65	thf(c_0_7, axiom, (mand)=(^[X4:$i > $o, X5:$i > $o, X198:$i]:~((~(X4 @ X198)|~(X5 @ X198)))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[mand, mnot]), mor])).
2.41/2.65	thf(c_0_8, axiom, (mimplies)=(^[X4:$i > $o, X5:$i > $o, X201:$i]:(~(X4 @ X201)|X5 @ X201)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[mimplies, mnot]), mor])).
2.41/2.65	thf(c_0_9, negated_conjecture, ~(![X21953:$i, X21964:$i]:(~rel_s4 @ X21953 @ X21964|(~(~((~(![X21965:$i]:(~rel_s4 @ X21964 @ X21965|leq @ n0 @ pv31 @ X21965))|~(~((~(![X21966:$i]:(~rel_s4 @ X21964 @ X21966|leq @ n0 @ pv35 @ X21966))|~(~((~(![X21967:$i]:(~rel_s4 @ X21964 @ X21967|leq @ pv31 @ (minus @ n5 @ n1) @ X21967))|~(![X21968:$i]:(~rel_s4 @ X21964 @ X21968|leq @ pv35 @ (minus @ n135300 @ n1) @ X21968)))))))))))|~((~(![X21969:$i]:(~rel_s4 @ X21964 @ X21969|leq @ n0 @ pv31 @ X21969))|~(~((~(![X21970:$i]:(~rel_s4 @ X21964 @ X21970|leq @ n0 @ pv35 @ X21970))|~(~((~(![X21971:$i]:(~rel_s4 @ X21964 @ X21971|leq @ pv31 @ (minus @ n5 @ n1) @ X21971))|~(![X21972:$i]:(~rel_s4 @ X21964 @ X21972|leq @ pv35 @ (minus @ n135300 @ n1) @ X21972))))))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cl5_nebula_array_0014]), c_0_7]), c_0_8]), mvalid]), mbox_s4])])).
2.41/2.65	thf(c_0_10, negated_conjecture, ![X23121:$i, X23122:$i, X23123:$i, X23124:$i]:(rel_s4 @ esk114_0 @ esk115_0&(((~rel_s4 @ esk115_0 @ X23121|leq @ n0 @ pv31 @ X23121)&((~rel_s4 @ esk115_0 @ X23122|leq @ n0 @ pv35 @ X23122)&((~rel_s4 @ esk115_0 @ X23123|leq @ pv31 @ (minus @ n5 @ n1) @ X23123)&(~rel_s4 @ esk115_0 @ X23124|leq @ pv35 @ (minus @ n135300 @ n1) @ X23124))))&(((((rel_s4 @ esk115_0 @ esk119_0|rel_s4 @ esk115_0 @ esk118_0|rel_s4 @ esk115_0 @ esk117_0|rel_s4 @ esk115_0 @ esk116_0)&(~leq @ pv35 @ (minus @ n135300 @ n1) @ esk119_0|rel_s4 @ esk115_0 @ esk118_0|rel_s4 @ esk115_0 @ esk117_0|rel_s4 @ esk115_0 @ esk116_0))&((rel_s4 @ esk115_0 @ esk119_0|~leq @ pv31 @ (minus @ n5 @ n1) @ esk118_0|rel_s4 @ esk115_0 @ esk117_0|rel_s4 @ esk115_0 @ esk116_0)&(~leq @ pv35 @ (minus @ n135300 @ n1) @ esk119_0|~leq @ pv31 @ (minus @ n5 @ n1) @ esk118_0|rel_s4 @ esk115_0 @ esk117_0|rel_s4 @ esk115_0 @ esk116_0)))&(((rel_s4 @ esk115_0 @ esk119_0|rel_s4 @ esk115_0 @ esk118_0|~leq @ n0 @ pv35 @ esk117_0|rel_s4 @ esk115_0 @ esk116_0)&(~leq @ pv35 @ (minus @ n135300 @ n1) @ esk119_0|rel_s4 @ esk115_0 @ esk118_0|~leq @ n0 @ pv35 @ esk117_0|rel_s4 @ esk115_0 @ esk116_0))&((rel_s4 @ esk115_0 @ esk119_0|~leq @ pv31 @ (minus @ n5 @ n1) @ esk118_0|~leq @ n0 @ pv35 @ esk117_0|rel_s4 @ esk115_0 @ esk116_0)&(~leq @ pv35 @ (minus @ n135300 @ n1) @ esk119_0|~leq @ pv31 @ (minus @ n5 @ n1) @ esk118_0|~leq @ n0 @ pv35 @ esk117_0|rel_s4 @ esk115_0 @ esk116_0))))&((((rel_s4 @ esk115_0 @ esk119_0|rel_s4 @ esk115_0 @ esk118_0|rel_s4 @ esk115_0 @ esk117_0|~leq @ n0 @ pv31 @ esk116_0)&(~leq @ pv35 @ (minus @ n135300 @ n1) @ esk119_0|rel_s4 @ esk115_0 @ esk118_0|rel_s4 @ esk115_0 @ esk117_0|~leq @ n0 @ pv31 @ esk116_0))&((rel_s4 @ esk115_0 @ esk119_0|~leq @ pv31 @ (minus @ n5 @ n1) @ esk118_0|rel_s4 @ esk115_0 @ esk117_0|~leq @ n0 @ pv31 @ esk116_0)&(~leq @ pv35 @ (minus @ n135300 @ n1) @ esk119_0|~leq @ pv31 @ (minus @ n5 @ n1) @ esk118_0|rel_s4 @ esk115_0 @ esk117_0|~leq @ n0 @ pv31 @ esk116_0)))&(((rel_s4 @ esk115_0 @ esk119_0|rel_s4 @ esk115_0 @ esk118_0|~leq @ n0 @ pv35 @ esk117_0|~leq @ n0 @ pv31 @ esk116_0)&(~leq @ pv35 @ (minus @ n135300 @ n1) @ esk119_0|rel_s4 @ esk115_0 @ esk118_0|~leq @ n0 @ pv35 @ esk117_0|~leq @ n0 @ pv31 @ esk116_0))&((rel_s4 @ esk115_0 @ esk119_0|~leq @ pv31 @ (minus @ n5 @ n1) @ esk118_0|~leq @ n0 @ pv35 @ esk117_0|~leq @ n0 @ pv31 @ esk116_0)&(~leq @ pv35 @ (minus @ n135300 @ n1) @ esk119_0|~leq @ pv31 @ (minus @ n5 @ n1) @ esk118_0|~leq @ n0 @ pv35 @ esk117_0|~leq @ n0 @ pv31 @ esk116_0))))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])])).
2.41/2.66	thf(c_0_11, negated_conjecture, (rel_s4 @ esk115_0 @ esk119_0|rel_s4 @ esk115_0 @ esk118_0|~leq @ n0 @ pv35 @ esk117_0|~leq @ n0 @ pv31 @ esk116_0), inference(split_conjunct,[status(thm)],[c_0_10])).
2.41/2.66	thf(c_0_12, negated_conjecture, ![X3:$i]:(leq @ n0 @ pv35 @ X3|~rel_s4 @ esk115_0 @ X3), inference(split_conjunct,[status(thm)],[c_0_10])).
2.41/2.66	thf(c_0_13, negated_conjecture, (rel_s4 @ esk115_0 @ esk119_0|rel_s4 @ esk115_0 @ esk118_0|rel_s4 @ esk115_0 @ esk117_0|~leq @ n0 @ pv31 @ esk116_0), inference(split_conjunct,[status(thm)],[c_0_10])).
2.41/2.66	thf(c_0_14, negated_conjecture, (rel_s4 @ esk115_0 @ esk119_0|rel_s4 @ esk115_0 @ esk118_0|rel_s4 @ esk115_0 @ esk116_0|~leq @ n0 @ pv35 @ esk117_0), inference(split_conjunct,[status(thm)],[c_0_10])).
2.41/2.66	thf(c_0_15, negated_conjecture, (rel_s4 @ esk115_0 @ esk119_0|rel_s4 @ esk115_0 @ esk118_0|rel_s4 @ esk115_0 @ esk117_0|rel_s4 @ esk115_0 @ esk116_0), inference(split_conjunct,[status(thm)],[c_0_10])).
2.41/2.66	thf(c_0_16, negated_conjecture, (rel_s4 @ esk115_0 @ esk119_0|rel_s4 @ esk115_0 @ esk118_0|~leq @ n0 @ pv31 @ esk116_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_12]), c_0_13])).
2.41/2.66	thf(c_0_17, negated_conjecture, ![X3:$i]:(leq @ n0 @ pv31 @ X3|~rel_s4 @ esk115_0 @ X3), inference(split_conjunct,[status(thm)],[c_0_10])).
2.41/2.66	thf(c_0_18, negated_conjecture, (rel_s4 @ esk115_0 @ esk119_0|rel_s4 @ esk115_0 @ esk118_0|rel_s4 @ esk115_0 @ esk116_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_12]), c_0_15])).
2.41/2.66	thf(c_0_19, negated_conjecture, (rel_s4 @ esk115_0 @ esk118_0|rel_s4 @ esk115_0 @ esk117_0|~leq @ pv35 @ (minus @ n135300 @ n1) @ esk119_0|~leq @ n0 @ pv31 @ esk116_0), inference(split_conjunct,[status(thm)],[c_0_10])).
2.41/2.66	thf(c_0_20, negated_conjecture, (rel_s4 @ esk115_0 @ esk118_0|~leq @ pv35 @ (minus @ n135300 @ n1) @ esk119_0|~leq @ n0 @ pv35 @ esk117_0|~leq @ n0 @ pv31 @ esk116_0), inference(split_conjunct,[status(thm)],[c_0_10])).
2.41/2.66	thf(c_0_21, negated_conjecture, ![X3:$i]:(leq @ pv35 @ (minus @ n135300 @ n1) @ X3|~rel_s4 @ esk115_0 @ X3), inference(split_conjunct,[status(thm)],[c_0_10])).
2.41/2.66	thf(c_0_22, negated_conjecture, (rel_s4 @ esk115_0 @ esk118_0|rel_s4 @ esk115_0 @ esk119_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_18])).
2.41/2.66	thf(c_0_23, negated_conjecture, (rel_s4 @ esk115_0 @ esk118_0|rel_s4 @ esk115_0 @ esk117_0|rel_s4 @ esk115_0 @ esk116_0|~leq @ pv35 @ (minus @ n135300 @ n1) @ esk119_0), inference(split_conjunct,[status(thm)],[c_0_10])).
2.41/2.66	thf(c_0_24, negated_conjecture, (rel_s4 @ esk115_0 @ esk118_0|rel_s4 @ esk115_0 @ esk117_0|~leq @ pv35 @ (minus @ n135300 @ n1) @ esk119_0|~rel_s4 @ esk115_0 @ esk116_0), inference(spm,[status(thm)],[c_0_19, c_0_17])).
2.41/2.66	thf(c_0_25, negated_conjecture, (rel_s4 @ esk115_0 @ esk119_0|rel_s4 @ esk115_0 @ esk117_0|~leq @ pv31 @ (minus @ n5 @ n1) @ esk118_0|~leq @ n0 @ pv31 @ esk116_0), inference(split_conjunct,[status(thm)],[c_0_10])).
2.41/2.66	thf(c_0_26, negated_conjecture, (~leq @ pv35 @ (minus @ n135300 @ n1) @ esk119_0|~leq @ pv31 @ (minus @ n5 @ n1) @ esk118_0|~leq @ n0 @ pv35 @ esk117_0|~leq @ n0 @ pv31 @ esk116_0), inference(split_conjunct,[status(thm)],[c_0_10])).
2.41/2.66	thf(c_0_27, negated_conjecture, ![X3:$i]:(leq @ pv31 @ (minus @ n5 @ n1) @ X3|~rel_s4 @ esk115_0 @ X3), inference(split_conjunct,[status(thm)],[c_0_10])).
2.41/2.66	thf(c_0_28, negated_conjecture, (rel_s4 @ esk115_0 @ esk118_0|~leq @ n0 @ pv35 @ esk117_0|~leq @ n0 @ pv31 @ esk116_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21]), c_0_22])).
2.41/2.66	thf(c_0_29, negated_conjecture, (rel_s4 @ esk115_0 @ esk119_0|~leq @ pv31 @ (minus @ n5 @ n1) @ esk118_0|~leq @ n0 @ pv35 @ esk117_0|~leq @ n0 @ pv31 @ esk116_0), inference(split_conjunct,[status(thm)],[c_0_10])).
2.41/2.66	thf(c_0_30, negated_conjecture, (rel_s4 @ esk115_0 @ esk117_0|rel_s4 @ esk115_0 @ esk118_0|~leq @ pv35 @ (minus @ n135300 @ n1) @ esk119_0), inference(csr,[status(thm)],[c_0_23, c_0_24])).
2.41/2.66	thf(c_0_31, negated_conjecture, (rel_s4 @ esk115_0 @ esk119_0|rel_s4 @ esk115_0 @ esk117_0|rel_s4 @ esk115_0 @ esk116_0|~leq @ pv31 @ (minus @ n5 @ n1) @ esk118_0), inference(split_conjunct,[status(thm)],[c_0_10])).
2.41/2.66	thf(c_0_32, negated_conjecture, (rel_s4 @ esk115_0 @ esk119_0|rel_s4 @ esk115_0 @ esk117_0|~leq @ pv31 @ (minus @ n5 @ n1) @ esk118_0|~rel_s4 @ esk115_0 @ esk116_0), inference(spm,[status(thm)],[c_0_25, c_0_17])).
2.41/2.66	thf(c_0_33, negated_conjecture, (~leq @ pv35 @ (minus @ n135300 @ n1) @ esk119_0|~leq @ n0 @ pv35 @ esk117_0|~leq @ n0 @ pv31 @ esk116_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_27]), c_0_28])).
2.41/2.66	thf(c_0_34, negated_conjecture, (rel_s4 @ esk115_0 @ esk119_0|~leq @ n0 @ pv35 @ esk117_0|~leq @ n0 @ pv31 @ esk116_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_27]), c_0_28])).
2.41/2.66	thf(c_0_35, negated_conjecture, (rel_s4 @ esk115_0 @ esk117_0|~leq @ pv35 @ (minus @ n135300 @ n1) @ esk119_0|~leq @ pv31 @ (minus @ n5 @ n1) @ esk118_0|~leq @ n0 @ pv31 @ esk116_0), inference(split_conjunct,[status(thm)],[c_0_10])).
2.41/2.66	thf(c_0_36, negated_conjecture, (rel_s4 @ esk115_0 @ esk118_0|rel_s4 @ esk115_0 @ esk117_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_21]), c_0_22])).
2.41/2.66	thf(c_0_37, negated_conjecture, (rel_s4 @ esk115_0 @ esk117_0|rel_s4 @ esk115_0 @ esk119_0|~leq @ pv31 @ (minus @ n5 @ n1) @ esk118_0), inference(csr,[status(thm)],[c_0_31, c_0_32])).
2.41/2.66	thf(c_0_38, negated_conjecture, (~leq @ n0 @ pv35 @ esk117_0|~leq @ n0 @ pv31 @ esk116_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_21]), c_0_34])).
2.41/2.66	thf(c_0_39, negated_conjecture, (rel_s4 @ esk115_0 @ esk117_0|~leq @ pv35 @ (minus @ n135300 @ n1) @ esk119_0|~leq @ n0 @ pv31 @ esk116_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35, c_0_27]), c_0_36])).
2.41/2.66	thf(c_0_40, negated_conjecture, (rel_s4 @ esk115_0 @ esk119_0|rel_s4 @ esk115_0 @ esk117_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37, c_0_27]), c_0_36])).
2.41/2.66	thf(c_0_41, negated_conjecture, (~leq @ n0 @ pv35 @ esk117_0|~rel_s4 @ esk115_0 @ esk116_0), inference(spm,[status(thm)],[c_0_38, c_0_17])).
2.41/2.66	thf(c_0_42, negated_conjecture, (rel_s4 @ esk115_0 @ esk117_0|~leq @ n0 @ pv31 @ esk116_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39, c_0_21]), c_0_40])).
2.41/2.66	thf(c_0_43, negated_conjecture, (~rel_s4 @ esk115_0 @ esk116_0|~rel_s4 @ esk115_0 @ esk117_0), inference(spm,[status(thm)],[c_0_41, c_0_12])).
2.41/2.67	thf(c_0_44, negated_conjecture, (rel_s4 @ esk115_0 @ esk116_0|~leq @ pv35 @ (minus @ n135300 @ n1) @ esk119_0|~leq @ pv31 @ (minus @ n5 @ n1) @ esk118_0|~leq @ n0 @ pv35 @ esk117_0), inference(split_conjunct,[status(thm)],[c_0_10])).
2.41/2.67	thf(c_0_45, negated_conjecture, (rel_s4 @ esk115_0 @ esk117_0|rel_s4 @ esk115_0 @ esk116_0|~leq @ pv35 @ (minus @ n135300 @ n1) @ esk119_0|~leq @ pv31 @ (minus @ n5 @ n1) @ esk118_0), inference(split_conjunct,[status(thm)],[c_0_10])).
2.41/2.67	thf(c_0_46, negated_conjecture, ~rel_s4 @ esk115_0 @ esk116_0, inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42, c_0_17]), c_0_43])).
2.41/2.67	thf(c_0_47, negated_conjecture, (~leq @ pv35 @ (minus @ n135300 @ n1) @ esk119_0|~leq @ pv31 @ (minus @ n5 @ n1) @ esk118_0|~leq @ n0 @ pv35 @ esk117_0), inference(csr,[status(thm)],[c_0_44, c_0_41])).
2.41/2.67	thf(c_0_48, negated_conjecture, (rel_s4 @ esk115_0 @ esk117_0|~leq @ pv35 @ (minus @ n135300 @ n1) @ esk119_0|~leq @ pv31 @ (minus @ n5 @ n1) @ esk118_0), inference(sr,[status(thm)],[c_0_45, c_0_46])).
2.41/2.67	thf(c_0_49, negated_conjecture, (~leq @ pv35 @ (minus @ n135300 @ n1) @ esk119_0|~leq @ n0 @ pv35 @ esk117_0|~rel_s4 @ esk115_0 @ esk118_0), inference(spm,[status(thm)],[c_0_47, c_0_27])).
2.41/2.67	thf(c_0_50, negated_conjecture, (rel_s4 @ esk115_0 @ esk119_0|rel_s4 @ esk115_0 @ esk116_0|~leq @ pv31 @ (minus @ n5 @ n1) @ esk118_0|~leq @ n0 @ pv35 @ esk117_0), inference(split_conjunct,[status(thm)],[c_0_10])).
2.41/2.67	thf(c_0_51, negated_conjecture, (rel_s4 @ esk115_0 @ esk117_0|~leq @ pv35 @ (minus @ n135300 @ n1) @ esk119_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48, c_0_27]), c_0_36])).
2.41/2.67	thf(c_0_52, negated_conjecture, (~leq @ n0 @ pv35 @ esk117_0|~rel_s4 @ esk115_0 @ esk118_0|~rel_s4 @ esk115_0 @ esk119_0), inference(spm,[status(thm)],[c_0_49, c_0_21])).
2.41/2.67	thf(c_0_53, negated_conjecture, (rel_s4 @ esk115_0 @ esk119_0|rel_s4 @ esk115_0 @ esk116_0|~leq @ pv31 @ (minus @ n5 @ n1) @ esk118_0|~rel_s4 @ esk115_0 @ esk117_0), inference(spm,[status(thm)],[c_0_50, c_0_12])).
2.41/2.67	thf(c_0_54, negated_conjecture, rel_s4 @ esk115_0 @ esk117_0, inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_51, c_0_21]), c_0_40])).
2.41/2.67	thf(c_0_55, negated_conjecture, (~rel_s4 @ esk115_0 @ esk118_0|~rel_s4 @ esk115_0 @ esk119_0|~rel_s4 @ esk115_0 @ esk117_0), inference(spm,[status(thm)],[c_0_52, c_0_12])).
2.41/2.67	thf(c_0_56, negated_conjecture, (rel_s4 @ esk115_0 @ esk119_0|~leq @ pv31 @ (minus @ n5 @ n1) @ esk118_0), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53, c_0_54])]), c_0_46])).
2.41/2.67	thf(c_0_57, negated_conjecture, (rel_s4 @ esk115_0 @ esk118_0|rel_s4 @ esk115_0 @ esk116_0|~leq @ pv35 @ (minus @ n135300 @ n1) @ esk119_0|~leq @ n0 @ pv35 @ esk117_0), inference(split_conjunct,[status(thm)],[c_0_10])).
2.41/2.67	thf(c_0_58, negated_conjecture, (~rel_s4 @ esk115_0 @ esk118_0|~rel_s4 @ esk115_0 @ esk119_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55, c_0_54])])).
2.41/2.67	thf(c_0_59, negated_conjecture, rel_s4 @ esk115_0 @ esk119_0, inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56, c_0_27]), c_0_22])).
2.41/2.67	thf(c_0_60, negated_conjecture, (rel_s4 @ esk115_0 @ esk118_0|rel_s4 @ esk115_0 @ esk116_0|~leq @ pv35 @ (minus @ n135300 @ n1) @ esk119_0|~rel_s4 @ esk115_0 @ esk117_0), inference(spm,[status(thm)],[c_0_57, c_0_12])).
2.41/2.67	thf(c_0_61, negated_conjecture, ~rel_s4 @ esk115_0 @ esk118_0, inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58, c_0_59])])).
2.41/2.67	thf(c_0_62, negated_conjecture, ~leq @ pv35 @ (minus @ n135300 @ n1) @ esk119_0, inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_60, c_0_54])]), c_0_46]), c_0_61])).
2.41/2.67	thf(c_0_63, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62, c_0_21]), c_0_59])]), ['proof']).
2.41/2.67	# SZS output end CNFRefutation
2.41/2.67	# Proof object total steps             : 64
2.41/2.67	# Proof object clause steps            : 53
2.41/2.67	# Proof object formula steps           : 11
2.41/2.67	# Proof object conjectures             : 56
2.41/2.67	# Proof object clause conjectures      : 53
2.41/2.67	# Proof object formula conjectures     : 3
2.41/2.67	# Proof object initial clauses used    : 20
2.41/2.67	# Proof object initial formulas used   : 7
2.41/2.67	# Proof object generating inferences   : 25
2.41/2.67	# Proof object simplifying inferences  : 32
2.41/2.67	# Training examples: 0 positive, 0 negative
2.41/2.67	# Parsed axioms                        : 280
2.41/2.67	# Removed by relevancy pruning/SinE    : 0
2.41/2.67	# Initial clauses                      : 1943
2.41/2.67	# Removed in clause preprocessing      : 72
2.41/2.67	# Initial clauses in saturation        : 1871
2.41/2.67	# Processed clauses                    : 1985
2.41/2.67	# ...of these trivial                  : 0
2.41/2.67	# ...subsumed                          : 2
2.41/2.67	# ...remaining for further processing  : 1983
2.41/2.67	# Other redundant clauses eliminated   : 0
2.41/2.67	# Clauses deleted for lack of memory   : 0
2.41/2.67	# Backward-subsumed                    : 27
2.41/2.67	# Backward-rewritten                   : 12
2.41/2.67	# Generated clauses                    : 192
2.41/2.67	# ...of the previous two non-trivial   : 160
2.41/2.67	# Contextual simplify-reflections      : 19
2.41/2.67	# Paramodulations                      : 192
2.41/2.67	# Factorizations                       : 0
2.41/2.67	# NegExts                              : 0
2.41/2.67	# Equation resolutions                 : 0
2.41/2.67	# Propositional unsat checks           : 0
2.41/2.67	#    Propositional check models        : 0
2.41/2.67	#    Propositional check unsatisfiable : 0
2.41/2.67	#    Propositional clauses             : 0
2.41/2.67	#    Propositional clauses after purity: 0
2.41/2.67	#    Propositional unsat core size     : 0
2.41/2.67	#    Propositional preprocessing time  : 0.000
2.41/2.67	#    Propositional encoding time       : 0.000
2.41/2.67	#    Propositional solver time         : 0.000
2.41/2.67	#    Success case prop preproc time    : 0.000
2.41/2.67	#    Success case prop encoding time   : 0.000
2.41/2.67	#    Success case prop solver time     : 0.000
2.41/2.67	# Current number of processed clauses  : 73
2.41/2.67	#    Positive orientable unit clauses  : 42
2.41/2.67	#    Positive unorientable unit clauses: 0
2.41/2.67	#    Negative unit clauses             : 3
2.41/2.67	#    Non-unit-clauses                  : 28
2.41/2.67	# Current number of unprocessed clauses: 1915
2.41/2.67	# ...number of literals in the above   : 18652
2.41/2.67	# Current number of archived formulas  : 0
2.41/2.67	# Current number of archived clauses   : 1910
2.41/2.67	# Clause-clause subsumption calls (NU) : 3473385
2.41/2.67	# Rec. Clause-clause subsumption calls : 33610
2.41/2.67	# Non-unit clause-clause subsumptions  : 45
2.41/2.67	# Unit Clause-clause subsumption calls : 374
2.41/2.67	# Rewrite failures with RHS unbound    : 0
2.41/2.67	# BW rewrite match attempts            : 15
2.41/2.67	# BW rewrite match successes           : 4
2.41/2.67	# Condensation attempts                : 0
2.41/2.67	# Condensation successes               : 0
2.41/2.67	# Termbank termtop insertions          : 465265
2.41/2.68	
2.41/2.68	# -------------------------------------------------
2.41/2.68	# User time                : 2.155 s
2.41/2.68	# System time              : 0.200 s
2.41/2.68	# Total time               : 2.355 s
2.41/2.68	# Maximum resident set size: 2148 pages
2.41/2.68	EOF